Holkner. Acceleration Techniques for Busy Beaver Candidates ACCELERATION TECHNIQUES FOR BUSY BEAVER CANDIDATES
نویسنده
چکیده
ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of printed symbols than all other machines of N states. Candidates for this class of Turing machine cannot realistically be run on a traditional simulator due to their high demands on memory and time. This paper describes some techniques that can be used to run these machines to completion with limited memory, in a reasonable amount of time, and without human intervention. These techniques include using k-macro tape representation and arcs, and automatic inductive proof generation and utilization.
منابع مشابه
(Preliminary Version) Evolutionary Turing Machines – The Quest for Busy Beavers
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposing ...
متن کاملAttacking the Busy Beaver 5
Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or even compute special values of Σ. Σ(5) is not yet known. A new approach to the computation of Σ(5) is presented, together with preliminary results, especially Σ(5)≥4098. This approach includes techniques to reduce the number of inspected Turing machines, to accelerate si...
متن کاملThe Influence of Learning in the Evolution of Busy Beavers
The goal of this research is to study how individual learning interacts with an evolutionary algorithm in its search for good candidates for the Busy Beaver problem. Two learning models, designed to act as local search procedures, are proposed. Experimental results show that local search methods that are able to perform several modifications in the structure of an individual in each learning st...
متن کاملToo Busy to Learn
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best candidates for the Busy Beaver problem. To study this interaction two learning models, implemented as local search procedures, are proposed. Experimental results show that, in highly irregular and prone to premature convergence search spaces, local search methods are n...
متن کاملAnalysis of Busy Beaver Machines via Induction Proofs
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this value is to determine whether or not a given n-state Turing machine halts. Whilst this is undecidable in general, it is known to be decidable for n ≤ 3, and undecidable for n ≥ 19. In particular, the decidability question i...
متن کامل